A Novel Weighted Visual Cryptography Scheme with High Visual Quality

نویسندگان

  • I-Chun Weng
  • Tzung-Her Chen
چکیده

Visual Cryptography (VC) has been developed to encode a secret image into n shares for n participants in the past decades, in which each share is treated with the same priority. However, the privilege for participants in a group is not always the same. In this paper, a weighted visual cryptography scheme is proposed such that each participant obtains her/his share with different weight according to the different group of predefined privilege. The secret can be disclosed only if stacking predefined k or more shares in which containing predefined some specific shares from the specific groups. Otherwise, no information about the secret can be revealed. It is worthwhile to note that the higher value of total weight of stacking shares; the more information about the secret revealed from the stacked result. The experimental results demonstrate that the proposed scheme does work.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Pixel Expansion of Hypergraph Access Structures in Visual Cryptography Schemes

In a visual cryptography scheme, a secret image is encoded into n shares, in the form of transparencies. The shares are then distributed to n participants. Qualified subsets of participants can recover the secret image by superimposing their transparencies, but non-qualified subsets of participants have no information about the secret image. Pixel expansion, which represents the number of subpi...

متن کامل

Maximal Independent Sets for the Pixel Expansion of Graph Access Structure

 Abstract : A visual cryptography scheme based on a given graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper a maximal independent sets of the graph G was ...

متن کامل

MAXIMAL INDEPENDENT SETS FOR THE PIXEL EXPANSION OF GRAPH ACCESS STRUCTURE

Given a graph G, a visual cryptography scheme based on the graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper we apply maximal independent sets of the grap...

متن کامل

A Novel Secured Transmission Of Color Extended Visual Images Using Error Diffusion

Cryptography is the science of writing in secret code and is an ancient art. Cryptography not only protects data from theft or alteration, but can also be used for user authentication.visual cryptography is a technique which allows visual information to be encrypted in such a way that the decryption can be performed by the human visual system. This paper introduces the concept of visual informa...

متن کامل

Novel Non-expanded Visual Cryptography Scheme with Block Encoding

In the traditional visual cryptography, secret pixels are expanded to cause the size of the recovered image is larger than the original one. Although many researches successfully solve expansion problem, the quality of the recovered image is not better. In order to improve quality of reconstruction, this paper proposes a novel nonexpansion scheme. The principle of the proposed scheme is to divi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • I. J. Network Security

دوره 19  شماره 

صفحات  -

تاریخ انتشار 2017